Rounding in symmetric matrices and undirected graphs
نویسندگان
چکیده
منابع مشابه
Symmetric and Asymmetric Rounding
If rounded data are used in estimating moments and regression coffiecients, the estimates are typically more or less biased. The purpose of the paper is to study the bias inducing effect of rounding, which is also seen when population moments intstead of their estimates are considered. Under appropriate conditions this effect can be approximately specified by versions of Sheppard’s correction f...
متن کاملSymmetric Randomized Dependent Rounding
Various forms of dependent rounding are useful when handling a mixture of “hard” (e.g., matroid) constraints and “soft” (packing) constraints. We consider a few classes of such problems that arise in facility location, where one aims for small additive violations of the packing constraints, and where we require substantial “near-independence” properties among the variables being rounded. While ...
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملUnbiased Rounding of Rational Matrices
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph coloring, in scheduling and in statistics. Here, it often is also desirable to round each entry randomly such that the probability of rounding it up equals its fractional part. This is known as unbiased rounding in stat...
متن کاملPageRank in Undirected Random Graphs
PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning. In this paper, we study PageRank in undirected random graphs with an expansion property. The Chung-Lu random graph is an example of such a graph. We show that in the limit, as the size of the graph goes to infinity, PageRank can be approximated by a mixture of the restart d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(96)81476-4